Rust and C++ performance on the Algorithmic Lovasz Local Lemma
نویسنده
چکیده
1 SUMMARY The performance and ease of use of a programming language are two major considerations for developers when choosing the appropriate language for a project. This work compares C++ and Rust through the lens of performance and usability in both serial and concurrent contexts, and uses the algorithmic Lovasz Local Lemma as a test-bed. Performance is evaluated quantitatively through run time statistics collected over different instances of K-SAT while usability is evaluated qualitatively. It was found that although both languages make trade-offs with respect to usability, Rust outperforms C++ in both serial and parallel contexts. From this the author concludes that, regardless of the performance of the optimal implementation in each language, non-optimal but more practical implementations of similar development effort seem to result in higher performance code in Rust, likely due to Rust’s ownership and safety features.
منابع مشابه
Lecture 3 : Constructive Bounds on Discrepancy
In previous lectures we saw a constructive proof of the Lovasz Local Lemma and an application to a variant of the max-min allocations problem. In this lecture we will continue the topic of algorithmic versions of existential theorems with a recent result due to Bansal [Ban10] that makes Spencer’s [Spe85] and Srinavasan’s [Sri97] bounds on discrepancy of set systems constructive. What makes Bans...
متن کاملLecture 10 – Algorithmic version of the local lemma
1 The local lemma Let A be a collection of random events A 1. .. A m. For event A i , let Γ(A i) be a minimal set of events that A i depends on in the sense that A i is independent of all events in A \ {Γ(A i) ∪ A i } (information on events not in Γ(A i) ∪ A i does not affect the probability of event A i happening). The general version of the Lovasz local lemma [4] (see also [1]) is as follows....
متن کاملA constructive quantum Lovasz local lemma for commuting projectors
The Quantum Satisfiability problem generalizes the Boolean satisfiability problem to the quantum setting by replacing classical clauses with local projectors. The Quantum Lovász Local Lemma gives a sufficient condition for a Quantum Satisfiability problem to be satisfiable [AKS12], by generalizing the classical Lovász Local Lemma. The next natural question that arises is: can a satisfying quant...
متن کاملAusgewählte Anwendungen des Lovasz Local Lemmas
Das Lovasz Local Lemma (LLL) ist eine der wichtigsten probabilistischen Methoden. Es wird angewendet um zu beweisen, dass bestimmte Ereignisse mit einer positiven Wahrscheinlichkeit eintreten können.[7] Da diese Wahrscheinlichkeit oft sehr klein ist, liefert das LLL keine effizienten Algorithmen. J.Beck hat als erster eine Methode entwickelt, um aus dem Existenzbeweis der LLL einen Polynomialze...
متن کاملشناسایی جدایه های Puccinia graminis f. sp. tritici با بیماریزایی برای ژن مقاومت Sr31 در استان های غربی ایران
Stem or black rust of wheat, caused by Puccinia graminis Pers. f. sp. tritici Eriks. and Henn (Pgt), was the most feared and devastating disease of wheat at one time worldwide. The fear from stem rust was understandable because an apparently healthy looking crop about 3 weeks prior to harvest could reduce to a black tangle of broken stems and shriveled grain by harvest. The disease has been co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017